منابع مشابه
Automating the Dependency Pair Method
Developing automatable methods for proving termination of term rewrite systems that resist traditional techniques based on simplification orders has become an active research area in the past few years. The dependency pair method of Arts and Giesl is one of the most popular such methods. However, there are several obstacles that hamper its automation. In this paper we present new ideas to overc...
متن کاملParallelizing the Dual Simplex Method Parallelizing the Dual Simplex Method
We study the parallelization of the steepest-edge version of the dual simplex algorithm. Three different parallel implementations are examined, each of which is derived from the CPLEX dual simplex implementation. One alternative uses PVM, one general-purpose System V shared-memory constructs, and one the PowerC extension of C on a Silicon Graphics multi-processor. These versions were tested on ...
متن کاملThe Real Multiple Dual
In this paper we present a dual representation for the multiple stopping problem, hence multiple exercise options. As such it is a natural generalization of the method in Rogers (2002) and Haugh and Kogan (2004) for the standard stopping problem for American options. We consider this representation as the real dual as it is solely expressed in terms of an infimum over martingales rather than an...
متن کاملPair comparing method
background, aims, methods, results) max 200 words: When studying how a response variable depends on an explanatory variable it is convenient to create pairs of matched observations, i.e. pairs consisting of two observations that are homogenous, except for the studied explanatory variables and the response variable. So, the matching procedure is a method with the purpose to control for different...
متن کاملComplexity, Graphs, and the Dependency Pair Method
This paper builds on recent e orts (Hirokawa and Moser, 2008) to exploit the dependency pair method for verifying feasible, i.e., polynomial runtime complexities of term rewrite systems automatically. We extend our earlier results by revisiting dependency graphs in the context of complexity analysis. The obtained new results are easy to implement and considerably extend the analytic power of ou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Perception & Psychophysics
سال: 2002
ISSN: 0031-5117,1532-5962
DOI: 10.3758/bf03196803